Rapid Quantum Search Algorithm
نویسندگان
چکیده
منابع مشابه
Fixed Phase Quantum Search Algorithm
Building quantum devices using fixed operators is a must to simplify the hardware construction. Quantum search engine is not an exception. In this paper, a fixed phase quantum search algorithm will be presented. Selecting phase shifts of 1.825π in the standard amplitude amplification will make the technique perform better so as to get probability of success at least 98% in O ( √
متن کاملGrover’s Search Algorithm and Quantum Lower Bounds
Searching an item in an unsorted database with size N costs a classical computer O(N) running time. Can a quantum computer search a needle in a haystack much more efficient than its classical counterpart? Grover, in 1996, affirmatively answered this question by proposing a search algorithm [4], which consults the database only O( N ) times. In contrast to algorithms based on the quantum Fourier...
متن کاملTradeoffs in the Quantum Search Algorithm
Quantum search is a quantum mechanical technique for searching N possibilities in only √ N steps. This has been proved to be the best possible algorithm for the exhuastive search problem in the sense the number of queries it requires cannot be reduced. However, as this paper shows, the number of non-query operations, and thus the total number of operations, can be reduced. The number of non-que...
متن کاملMulti-Qubit Dynamics Quantum Search Algorithm
Following the experimental work [M. W. Johnson, et al. Nature 473, 194 (2011)], we propose a new physical scheme for perfect implementation of quantum search algorithm in presence of the dissipation of qubits. Applying all the required steps for implementing the algorithm, the quantum gates are generated from the suggested model. During a critical portion of quantum annealing, the qubits become...
متن کاملDeterministic Application of Grover's Quantum Search Algorithm
Grover’s quantum search algorithm finds one of t solutions in N candidates by using (π/4) √ N/t basic steps. It is, however, necessary to know the number t of solutions in advance for using the Grover’s algorithm directly. On the other hand, Boyer etal proposed a randomized application of Grover’s algorithm, which runs, on average, in O( √ N/t) basic steps (more precisely, (9/4) √ N/t steps) wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Modern Physics
سال: 2013
ISSN: 2153-1196,2153-120X
DOI: 10.4236/jmp.2013.49158